Local finiteness for Green’s relations in semigroup varieties
نویسندگان
چکیده
A semigroup S is called locally finite (respectively, periodic) if each finitely generated (respectively, each monogenic) subsemigroup in S is finite. A semigroup variety is locally finite (respectively, periodic) if so are all its members. Clearly, every locally finite variety is periodic but the converse is not true. The issues related to determining extra properties that distinguish locally finite semigroup varieties amongst periodic ones form a vast research area known as Burnside type problems. The reader can find a brief introduction into the main achievements in this area in [34, Chapter 3]; for the present discussion, it suffices to reproduce here just one powerful result by Sapir (a part of [33, Theorem P]). Recall two notions involved in the formulation of Sapir’s result. A variety is said to be of finite axiomatic rank if for some fixed n > 0, it can be given by a set of identities involving at most n letters. (For instance, every variety defined by finitely many identities is of finite axiomatic rank.) A semigroup S is said to be a nilsemigroup if S has an element 0 such that s0 = 0s = 0 for every s ∈ S and a power of each element in S is equal to 0.
منابع مشابه
Green's-Like Relations on Algebras and Varieties
There are five equivalence relations known as Green’s relations definable on any semigroup or monoid, that is, on any algebra with a binary operation which is associative. In this paper, we examine whether Green’s relations can be defined on algebras of any type τ . Some sort of superassociativity is needed for such definitions to work, and we consider algebras which are clones of terms of type...
متن کاملComputing finite semigroups
Using a variant of Schreier’s Theorem, and the theory of Green’s relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملMultiplicative structure of 2 × 2 tropical matrices
We study the algebraic structure of the semigroup of all 2 × 2 tropical matrices under multiplication. Using ideas from tropical geometry, we give a complete description of Green’s relations and the idempotents and maximal subgroups of this semigroup.
متن کاملRegularity and Green's Relations on a Semigroup of Transformations with Restricted Range
Let T X be the full transformation semigroup on the setX and let T X,Y {α ∈ T X : Xα ⊆ Y}. Then T X,Y is a sub-semigroup of T X determined by a nonempty subset Y of X. In this paper, we give a necessary and sufficient condition for T X,Y to be regular. In the case that T X,Y is not regular, the largest regular sub-semigroup is obtained and this sub-semigroup is shown to determine the Green’s re...
متن کامل